Efficient Sorting and Searching in Rendering Algorithms

نویسندگان

  • Vlastimil Havran
  • Jirí Bittner
چکیده

In the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science. We will provide both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching. In particular we will discuss problems and solutions for visibility computation, density estimation, and importance sampling. For each problem we mention its specific issues such as dimensionality of the search domain or online versus offline searching. We will present the underlying data structures and their enhancements in the context of specific rendering algorithms such as ray shooting, photon mapping, and hidden surface removal. c © The Eurographics Association 2006. 2 Havran and Bittner / Efficient Sorting and Searching in Rendering Algorithms Organizers bibliographies Vlastimil Havran is an assistant professor at the Czech Technical University in Prague since February 2006. He defended his Ph.D. dissertation on ray shooting algorithms in 2001 at the Czech Technical University in Prague. Later he joined the computer graphics group at Max-Planck-Institute for Informatics in Saarbruecken. He became a research associate at the same institute in 2003. He has contributed to the topic of sorting and searching by his dissertation on ray shooting algorithms which started the area of interactive ray tracing. In addition to sorting and searching he worked on various other topics in rendering. Jiřı́ Bittner holds a Ph.D. in Computer Science from the Czech Technical University in Prague. His main research interests include visibility preprocessing, occlusion culling, real-time rendering, and computational geometry. He has also been active in development of two commercial products dealing with real-time rendering of large scenes. He is currently affiliated with the Vienna University of Technology and the Czech Technical University in Prague. Organizers contact information Vlastimil Havran Czech Technical University in Prague Karlovo náměstı́ 13 121 35 Praha 2 Czech Republic Phone:+42

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sorting, Searching, and Simulation in the MapReduce Framework

In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation problems. This study is motivated by a goal of ultimately putting the MapReduce framework on an equal theoretical footing with the well-known PRAM and BSP paralle...

متن کامل

Direct volume rendering of unstructured grids

This paper investigates three categories of algorithms for direct volume rendering of unstructured grids, which are image-space, object-space, and hybrid methods. We propose three new algorithms. Cell Projection algorithm, which falls into object-space category, is capable of rendering non-convex meshes through a simple yet efficient sorting schema that exploits both image and object space cohe...

متن کامل

Knitting Sort: A Novel Stable and Inplace Sorting Technique (An Extension of Exchange Sorting with Bitonic Sorting Network)

One of the most frequent operations performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Linear Search, Quadratic search[1], but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and eff...

متن کامل

Programming Research Group CONVERTING SORTING ALGORITHMS TO FAST RANDOMIZED ONES VIA SEARCHING

In this work we present an algorithmic transformation, that given two algorithms implementing respectively, sorting and searching, provides a randomized sorting algorithm that with high probability requires less time than the original sorting algorithm. This claim is true for a wide range of the parameters that describe the running time of the procedures for sorting and searching.

متن کامل

B-Flashsort: A High-performance Sort for the MasPar MP-1 and MP-2 Implementation Description

The sorting of large data sets is a key step in a great variety of applications such as query processing, polygon rendering, statistical analysis and optimization problems. While efficient sorting techniques and implementations have long been available for sequential computers, the problem remains a challenge for parallel computers. One reason is that efficient sequential algorithms take into a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006